A simple lattice-based PKE scheme
نویسندگان
چکیده
In this paper, we first present a new lattice-based PKE scheme on SIS, proving that it achieves CPA-security under DBi-ISIS assumption. Compared to some lattice-based schemes, ours has some advantages and is quite efficient as well as great simplicity. Similarly, we give a lattice-based PKE with multiple bits which is CPA secure under DBi-ISIS assumption. We hope that our contributions help to pave the way for the development of lattice-based PKEs in the future work.
منابع مشابه
Efficient Chosen-Ciphtertext Secure Public Key Encryption Scheme From Lattice Assumption
Using the Bonsai trees primitive and Gentry’s CPA-secure (chosen-plaintext attack) public-key encryption (PKE) scheme, we propose an efficient chosen-ciphtertext secure PKE scheme over lattice. If the decision variant of the learning with errors (LWE) problem is hard and the one-time signature used in this scheme is strong unforgeable, the proposed PKE scheme is indistinguishable against the ad...
متن کاملFully-Secure Lattice-Based IBE as Compact as PKE
We construct an identity-based encryption (IBE) scheme from the standard Learning with Errors (LWE) assumption, which both has a compact public-key (with size similar to known lattice-based PKE schemes) and also achieves adaptive security in the standard model. This improves over previous IBE schemes from lattices, which either have a public key that grows at least linearly with the length of t...
متن کاملA Lattice-Based Universal Thresholdizer for Cryptographic Systems
We develop a general approach to thresholdizing a large class of (non-threshold) cryptographic schemes. We show how to add threshold functionality to CCA-secure public-key encryption (PKE), signature schemes, pseudorandom functions, and others primitives. To do so, we introduce a general tool, called a universal thresholdizer, from which many threshold systems are possible. The tool builds upon...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملCertificateless Public Key Encryption ( CL - PKE ) Scheme Using Extended Chebyshev Polynomial over the Finite Field
In this paper, we introduce a new alternative model for a Certificateless Public Key Encryption (CL-PKE) scheme. Our proposed CL-PKE scheme uses the Identity Based Encryption (IBE) scheme extended over the finite field p to generate its encryption and decryption keys. The proposed system is applicable, secure, and reliable.
متن کامل